A constrained small baseline subsets (CSBAS) InSAR technique for multiple subsets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Structure Theory for Small Sum Subsets

We develop a new method leading the structure of finite subsets S and T of an abelian group with |S+T | ≤ |S|+ |T |. We show also how to recover the known results in this area in a relatively short space.

متن کامل

Well-dispersed subsets of non-dominated solutions for MOMILP ‎problem

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

Sierpiliski’s technique and subsets of R

Van Mill, J., Sierpitiski’s technique and subsets of Iw, Topology and its Applications 44 (1992) 241-261. Sierpiriski invented in 1932 a method for constructing examples, which is now known as the “technique of killing homeomorphisms”. This method was used by Ohkuma to construct a rigid homogeneous chain, and by van Douwen to construct a compact homogeneous space with a measure that “knows” whi...

متن کامل

Easy Sets Without Easy Small Subsets

We show the existence of relativized worlds relative to which there exist innnite polynomial-time computable sets without innnite polynomial-time computable sparse subsets or even non-deterministically polynomial-time computable sparse subsets. This result is tight since every innnite P set has an innnite sparse coNP subset.

متن کامل

Edge coloring multigraphs without small dense subsets

One consequence of an old conjecture of Goldberg and Seymour about the chromatic index of multigraphs would be the following statement. Suppose G is a multigraph with maximum degree ∆, such that no vertex subset S of odd size at most ∆ induces more than (∆+1)(|S|−1)/2 edges. Then G has an edge coloring with ∆ + 1 colors. Here we prove a weakened version of this statement.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Remote Sensing

سال: 2019

ISSN: 2279-7254

DOI: 10.1080/22797254.2019.1707715